Local Search Strategy to produce Schedules for a GPS Surveying Network

This paper introduces a new formulation for GPS networks which is an important technique in Surveying. The objective is to find an effective receiver schedule at least cost using heuristic techniques within the field of Operational Research. To evaluate the solution, a comparison with known optimal solution is made. Large networks (with unknown optimal schedules) were solved using Simulated Annealing and Tabu Search heuristic techniques. Further work is to solve these large networks and compare with the solution from heuristic techniques such as Genetic Algorithms.